Metric-learning-assisted domain adaptation
نویسندگان
چکیده
Domain alignment (DA) has been widely used in unsupervised domain adaptation. Many existing DA methods assume that a low source risk, together with the of distributions and target, means target risk. In this paper, we show does not always hold. We thus propose novel metric-learning-assisted adaptation (MLA-DA) method, which employs triplet loss for helping better feature alignment. explore relationship between second largest probability sample’s prediction its distance to decision boundary. Based on relationship, mechanism adaptively adjust margin according predictions. Experimental results use proposed can achieve clearly results. also demonstrate performance improvement MLA-DA all four standard benchmarks compared state-of-the-art methods. Furthermore, shows stable robust experiments.
منابع مشابه
Metric Learning for Graph-Based Domain Adaptation
In many domain adaption formulations, it is assumed to have large amount of unlabeled data from the domain of interest (target domain), some portion of it may be labeled, and large amount of labeled data from other domains, also known as source domain(s). Motivated by the fact that labeled data is hard to obtain in any domain, we design algorithms for the settings in which there exists large am...
متن کاملLearning and Domain Adaptation
Domain adaptation is a fundamental learning problem where one wishes to use labeled data from one or several source domains to learn a hypothesis performing well on a different, yet related, domain for which no labeled data is available. This generalization across domains is a very significant challenge for many machine learning applications and arises in a variety of natural settings, includin...
متن کاملLearning Bounds for Domain Adaptation
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classifier from a source domain with a large amount of training data to different target domain with very little training data. In this work we give uniform convergence bounds for algorithms that minimize a convex combinatio...
متن کاملDomain Adaptation by Active Learning
We tackled the Evalita 2011 Domain Adaptation task with a strategy of active learning. The DeSR parser can be configured to provide different measures of perplexity in its own ability to parse sentences correctly. After parsing sentences in the target domain, a small number of the sentences with the highest perplexity were selected, revised manually and added to the training corpus in order to ...
متن کاملLearning Algorithms for Domain Adaptation
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of training instances. In many practical settings, this ideal assumption is invalidated as the labeled training instances are scarce and there is a high cost associated with labeling them. On the other hand, we might have ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2021
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2021.05.023